Modular Construction of Finite and Complete Prefixes of Petri net Unfoldings
نویسندگان
چکیده
منابع مشابه
Complete Finite Prefixes of Symbolic Unfoldings of Time Petri Nets
Monitoring real-time concurrent systems is a challenging task. In this paper we formulate (model-based) supervision by means of hidden state history reconstruction, from event (e.g. alarm) observations. We follow a so-called true concurrency approach using time Petri nets: the model defines explicitly the causal and concurrency relations between the observable events, produced by the system und...
متن کاملAn Improved Construction of Petri Net Unfoldings
Petri nets are a well-known model language for concurrent systems. The unfolding of a Petri net is an acyclic net bisimilar to the original one. Because it is acyclic, it admits simpler decision problems though it is in general larger than the net. In this paper, we revisit the problem of efficiently constructing an unfolding. We propose a new method that avoids computing the concurrency relati...
متن کاملComplete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets
Time Petri nets have proved their interest in modeling realtime concurrent systems. Their usual semantics is defined in term of firing sequences, which can be coded in a (symbolic and global) state graph, computable from a bounded net. An alternative is to consider a “partial order” semantics given in term of processes, which keep explicit the notions of causality and concurrency without comput...
متن کاملTime Petri Net Unfoldings and Hardware Veriication
Real-time applications require hardware components to be predictable in terms of their temporal characteristics. For this reason synchronous (clocked) circuits have traditionally been used in real-time systems. With the advent of submicron technologies the role of asynchronous techniques in designing hardware platforms for real-time systems will dramatically increase. Yet the lack of eecient fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Informaticae
سال: 2009
ISSN: 0169-2968
DOI: 10.3233/fi-2009-148